On the spectra of the fullerenes that contain a nontrivial cyclic-5-cutset
نویسندگان
چکیده
A fullerene, which is a 3-connected cubic plane graph whose faces are pentagons and hexagons, is cyclically 5 edge-connected. For a fullerene of order n, it is customary to index the eigenvalues in non-increasing order λ1 ≥ λ2 ≥ · · · ≥ λn. It is known that the largest eigenvalue is 3. Let R = {fi | i ∈ Zl} be a set of l faces of a fullerene F such that fi is adjacent to fi+1, i ∈ Zl, via an edge ei. If the edges in {ei | i ∈ Zl} are independent, then we say that R forms a ring of l faces. In this paper we show that if a fullerene contains a nontrivial cyclic-5-cutset, then it has ∗ This work is partially supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University. † Corresponding author 42 W.C. SHIU, W. LI AND W.H. CHAN 2r − 2 eigenvalues that can be arranged in pairs {μ,−μ} (1 < μ < 3), where r is the number of the rings of five faces. Meanwhile 1 is one of its eigenvalues and λr+1 ≥ 1.
منابع مشابه
On cyclic edge-connectivity of fullerenes
A graph is said to be cyclic k-edge-connected, if at least k edges must be removed to disconnect it into two components, each containing a cycle. Such a set of k edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components induces a single k-cycle. It is known that fullerenes, that is, 3-connected cubic planar graphs all ...
متن کاملThe Sum Graph of Non-essential Submodules
Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...
متن کاملTheoretical and Structural Relationship Study of Electrochemical Properties of p- Sulfonated Calix[Slarene Macrocycles with Fullerenes as lp-Sulfonated Calliplarenesi@iCsl Supramolecular Complexes
Up to now, various empty carbon fullerenes with different magic number "n", such as C10, Cow Cm, Cso,Cis** Cm and so on. have been obtained. The calix[n]arenes are a class of chalice-like rnacrocyclicmolecules that have attracted widespread attention as complex molecules with liquid crystal behaviors.These classes of compounds are cyclic ohgomers synthessid by condensation of a para-alkylated p...
متن کاملA polynomial algorithm for cyclic edge connectivity of cubic graphs
In this paper, we develop a polynomial time algorithm to find out all the minilnum cyclic edge cutsets of a 3-regular graph, and therefore to determine the cyclic edge connectivity of a cubic graph. The algorithm is recursive, with complexity bounded by O(n31og2 n). The algorithm shows that the number of mini~um cyclic edge cut sets of a 3-regular graph G is polynornial in v( G) and that the mi...
متن کاملON COMULTIPLICATION AND R-MULTIPLICATION MODULES
We state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. In particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. Also we show that if M is an strong comultiplicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 47 شماره
صفحات -
تاریخ انتشار 2010